Inexact matching of ontology graphs using expectation-maximization
نویسندگان
چکیده
منابع مشابه
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology matching is crucial since we are witnessing a decentralized development and publication of ontological data. We formulate the problem of inferring a match between two ontologies as a maximum likelihood problem, and solve it using the technique of expectation-maximization (EM). Specifically...
متن کاملMultifactor Expectation Maximization for Factor Graphs
Factor graphs allow large probability distributions to be stored efficiently and facilitate fast computation of marginal probabilities, but the difficulty of training them has limited their use. Given a large set of data points, the training process should yield factors for which the observed data has a high likelihood. We present a factor graph learning algorithm which on each iteration merges...
متن کاملInexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacian. Given two sets of eigenvectors that correspond to the smallest non-null eigenvalues of the Laplacian matrices of two graphs, we project each graph onto its eigenenvectors. We estimate the histograms of these one-di...
متن کاملScalable Matching of Ontology Graphs Using Partitioning
The problem of ontology matching is crucial due to decentralized development and publication of ontological data. An approach proposed towards matching the ontologies is by inferring a match between two ontologies as a maximum likelihood problem, and solves it using the technique of expectation maximization (EM). The structural and lexical similarities between the graphs are identified in this ...
متن کاملExpectation Maximization Algorithm for Domain Specific Ontology Extraction
Learning ontology from unstructured text is a challenging task. Over the years, a lot of research has been done to predict ontological relation between a pair of concepts. However all these measures predict relation with a varying degree of accuracy. There has also been work on learning ontology by combining evidences from heterogeneous sources, but most of these algorithms are ad hoc in nature...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Web Semantics
سال: 2009
ISSN: 1570-8268
DOI: 10.1016/j.websem.2008.12.001